There Is No Classification of the Decidably Presentable Structures
نویسنده
چکیده
A computable structure A is decidable if, given a formula φ(x̄) of elementary first-order logic, and a tuple ā ∈ A, we have a decision procedure to decide whether φ holds of ā. We show that there is no reasonable classification of the decidably presentable structures. Formally, we show that the index set of the computable structures with decidable presentations is Σ1-complete. This result holds even if we restrict out attention to groups, graphs, or fields. We also show that the index sets of the computable structures with n-decidable presentations is Σ1-complete for any n.
منابع مشابه
Witt rings of quadratically presentable fields
This paper introduces an approach to the axiomatic theory of quadratic forms based on {tmem{presentable}} partially ordered sets, that is partially ordered sets subject to additional conditions which amount to a strong form of local presentability. It turns out that the classical notion of the Witt ring of symmetric bilinear forms over a field makes sense in the context of {tmem{quadratically p...
متن کاملAutomatic presentations for semigroups
This paper applies the concept of FA-presentable structures to semigroups. We give a complete classification of the finitely generated FA-presentable cancellative semigroups: namely, a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group. We prove that all finitely generated commutative semigroups are FA-presentable. We giv...
متن کاملUnary FA-Presentable Semigroups
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of interesting decision problems. A particular focus of research has been the classification of those structures of some species that admit automatic presentations. Whilst some successes have been obtained, this appears to be a difficult pro...
متن کاملAutomatic Presentations for Cancellative Semigroups
This paper studies FA-presentable structures and gives a complete classification of the finitely generated FA-presentable cancellative semigroups. We show that a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group.
متن کاملFA-presentable Groups and Rings
We consider structures which are FA-presentable. It is known that an FA-presentable finitely generated group is virtually abelian; we strengthen this result by showing that an arbitrary FA-presentable group is locally virtually abelian. As a consequence, we prove that any FA-presentable ring is locally finite; this is a significant restriction and allows us to say a great deal about the structu...
متن کامل